Exact Euclidean distance function by chain propagations
نویسنده
چکیده
Up to now, all the known Euclidean distance function algorithms are either excessively slow or inaccurate, and even Danielsson's method produces errors in some con gurations. We show that they are due to the local way distances are propagated in images by this algorithm. To remedy these drawbacks, an algorithm is introduced, which encodes the objects boundaries as chains and propagates these structures in the image using rewriting rules. The chains convey Euclidean distances and can be written above one another, thus yielding exact results. In addition, the proposed algorithm is particularly e cient. Some of its applications to skeletons and neighborhood graphs are described.
منابع مشابه
Polygonal chain approximation: a query based approach
In this paper we present a new, query based approach for approximating polygonal chains in the plane. We give a few results based on this approach, some of more general interest, and propose a greedy heuristic to speed up the computation. Our algorithms are simple, based on standard geometric operations, and thus suitable for efficient implementation. We also show that the query based approach ...
متن کامل3-D Parallel Exact Signed Euclidean Distance Transform
The computation speed for distance transforms becomes important in a wide variety of image processing applications. Current ITK library filters do not see any benefit from a multithreading environment. We introduce a three-dimensional signed parallel implementation of the exact Euclidean distance transform algorithm developed by Maurer et al.[1] with a theoretical complexity of O(n/p) for n vox...
متن کاملParallel N-Dimensional Exact Signed Euclidean Distance Transform
The computation speed for distance transforms becomes important in a wide variety of image processing applications. Current ITK library filters do not see any benefit from a multithreading environment. We introduce an N-dimensional signed parallel implementation of the exact Euclidean distance transform algorithm developed by Maurer et al.[1] with a theoretical complexity of O(n/p) for n voxels...
متن کاملThe Euclidean Distance Degree of an Algebraic Variety
The nearest point map of a real algebraic variety with respect to Euclidean distance is an algebraic function. For instance, for varieties of low rank matrices, the Eckart-Young Theorem states that this map is given by the singular value decomposition. This article develops a theory of such nearest point maps from the perspective of computational algebraic geometry. The Euclidean distance degre...
متن کاملGeometric Facility Location under Continuous Motion Bounded-Velocity Approximations to the Mobile Euclidean k-Centre and k-Median Problems
The traditional problems of facility location are defined statically; a set (or multiset) of n points is given as input, corresponding to the positions of clients, and a solution is returned consisting of set of k points, corresponding to the positions of facilities, that optimizes some objective function of the input set. In the k-centre problem, the objective is to select k points for locatin...
متن کامل